package leetcodecompetition.S116;

/**
 * @Author: Siantar
 * @Date: 2023-10-28-22:35
 * @Description: 1.0
 */
public class T100104 {
    public int minChanges(String s) {
        char[] cs = s.toCharArray();
        int n = cs.length, res = 0;
        for (int i = 0; i < n; i += 2) {
            if (cs[i] != cs[i + 1]) {
                res++;
            }
        }
        return res;
    }
}
